Advances in Homomorphic Cryptosystems
نویسنده
چکیده
During the last few years homomorphic encryption techniques have been studied extensively since they have become more and more important in many different cryptographic protocols such as voting protocols, lottery protocols, anonymity, privacy, and electronic auctions. This paper critically summarizes the current state-of-art of homomorphic cryptosystems. It recalls the basic ideas, discusses their parameters, performances and security issues. And, finally we present their capabilities in the future applications.
منابع مشابه
On non-abelian homomorphic public-key cryptosystems
An important problem of modern cryptography concerns secret public-key computations in algebraic structures. We construct homomorphic cryptosystems being (secret) epimorphisms f : G → H, where G,H are (publically known) groups and H is finite. A letter of a message to be encrypted is an element h ∈ H, while its encryption g ∈ G is such that f(g) = h. A homomorphic cryptosystem allows one to per...
متن کاملA general framework for building noise-free homomorphic cryptosystems
We present a general framework for developing and analyzing homomorphic cryptosystems whose security relies on the difficulty of solving systems of nonlinear equations over Zn, n being an RSA modulus. In this framework, many homomorphic cryptosystems can be conceptualized. Based on symmetry considerations, we propose a general assumption that ensures the security of these schemes. To highlight ...
متن کاملGeneral Impossibility of Group Homomorphic Encryption in the Quantum World
Group homomorphic encryption represents one of the most important building blocks in modern cryptography. It forms the basis of widely-used, more sophisticated primitives, such as CCA2-secure encryption or secure multiparty computation. Unfortunately, recent advances in quantum computation show that many of the existing schemes completely break down once quantum computers reach maturity (mainly...
متن کاملIntroduction to Homomorphic Encryption
Homomorphic encryption enables computations on encrypted data. This property makes such encryption schemes useful in a wide variety of privacy preserving applications. This paper provides a brief survey on the homomorphic encryption. We describe the homomorphic cryptosystems from partially homomorphic encryption to fully homomorphic encryption. We also give some security analysis and describe h...
متن کاملThreshold Cryptosystems Based on Factoring
We consider threshold cryptosystems over a composite modulus N where the factors of N are shared among the participants as the secret key. This is a new paradigm for threshold cryptosystems based on a composite modulus, differing from the typical treatment of RSA-based systems where a “decryption exponent” is shared among the participants. Our approach yields solutions to some open problems in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. UCS
دوره 15 شماره
صفحات -
تاریخ انتشار 2009